On Tape Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disk { Tape Joins : Synchronizing Disk and Tape

Today large amounts of data are stored on tertiary storage media such as magnetic tapes and optical disks. DBMSs typically operate only on magnetic disks since they know how to maneuver disks and how to optimize accesses on them. Tertiary devices present a problem for DBMSs since these devices have dismountable media and have very diier-ent operational characteristics compared to magnetic disks...

متن کامل

On Barycentric-Magic Graphs

Let $A$ be an abelian group. A graph $G=(V,E)$ is said to be $A$-barycentric-magic if there exists a labeling $l:E(G)longrightarrow Asetminuslbrace{0}rbrace$ such that the induced vertex set labeling $l^{+}:V(G)longrightarrow A$ defined by $l^{+}(v)=sum_{uvin E(G)}l(uv)$ is a constant map and also satisfies that $l^{+}(v)=deg(v)l(u_{v}v)$ for all $v in V$, and for some vertex $u_{v}$ adjacent t...

متن کامل

Scheduling Queries on Tape-resident Data

Advances in storage technology have made near-line tertiary storage a viable alternative for database and data warehouse systems. Tertiary storage systems are employed in cases where secondary storage can not satisfy the data handling requirements or tertiary storage is more cost eeective option. Tertiary storage devices have traditionally been used as archival storage. The new application doma...

متن کامل

On Generalized Coprime Graphs

Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

متن کامل

Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"

We consider the Gaussian Dirty Tape Channel (DTC) YY = XX + SS + ZZ , where SS is an additive Gaussian interference known causally to the transmitter. The general expression mmmmmmPPUU,ff(∙),XX=ff(UU,SS) II(UU;YY) is presented for the capacity of this channel. For linear assignment to ff(∙) , i.e. XX = UU− ββSS , this expression leads to the compensation strategy proposed previously by Willems ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics Research

سال: 2010

ISSN: 1916-9809,1916-9795

DOI: 10.5539/jmr.v2n4p79